Optimal Solutions for the Closest-String Problem via Integer Programming
نویسندگان
چکیده
منابع مشابه
Optimal Solutions for the Closest-String Problem via Integer Programming
Integer Programming Cláudio N. Meneses Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, Florida, 32611, USA, [email protected] Zhaosong Lu School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205, USA, [email protected] Carlos A.S. Oliveira, Panos M. Pardalos Department of Industrial and S...
متن کاملIterative Rounding for the Closest String Problem
The closest string problem is an NP-hard problem, which arises in computational molecular biology and coding theory. Its task is to find a string that minimizes maximum Hamming distance to a given set of strings. This problem can be reduced to an integer program (IP). However, to date, there exists no known polynomial-time algorithm for integer programs. In 2004, Meneses et al. introduced a bra...
متن کاملOptimal Generalized Decision Trees via Integer Programming
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a novel mixed integer programming formulation to construct optimal decision trees ...
متن کاملA Three-String Approach to the Closest String Problem
Article history: Received 18 May 2010 Received in revised form 11 January 2011 Accepted 21 January 2011 Available online 28 January 2011
متن کاملOptimal Decision Trees for Categorical Data via Integer Programming
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a novel mixed integer programming formulation to construct optimal decision trees ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2004
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1040.0090